首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3716篇
  免费   70篇
  国内免费   17篇
化学   2295篇
晶体学   23篇
力学   75篇
数学   598篇
物理学   812篇
  2021年   36篇
  2020年   59篇
  2019年   41篇
  2018年   25篇
  2017年   22篇
  2016年   45篇
  2015年   51篇
  2014年   47篇
  2013年   168篇
  2012年   162篇
  2011年   179篇
  2010年   99篇
  2009年   87篇
  2008年   153篇
  2007年   189篇
  2006年   177篇
  2005年   176篇
  2004年   169篇
  2003年   141篇
  2002年   125篇
  2001年   85篇
  2000年   96篇
  1999年   51篇
  1998年   65篇
  1997年   53篇
  1996年   56篇
  1995年   61篇
  1994年   50篇
  1993年   67篇
  1992年   43篇
  1991年   40篇
  1990年   44篇
  1989年   44篇
  1988年   37篇
  1987年   42篇
  1986年   41篇
  1985年   57篇
  1984年   47篇
  1983年   38篇
  1982年   34篇
  1981年   37篇
  1980年   37篇
  1979年   27篇
  1978年   31篇
  1977年   39篇
  1976年   45篇
  1975年   50篇
  1974年   41篇
  1973年   47篇
  1972年   18篇
排序方式: 共有3803条查询结果,搜索用时 78 毫秒
21.
22.
Many-neighbour interaction and non-locality in traffic models   总被引:1,自引:0,他引:1  
The optimal-velocity model, as proposed by Bando et al. [1], shows unrealistic values of the acceleration for various optimal-velocity functions [2,3]. We discuss different approaches of how to correct this problem. Multiple look-ahead (many-neighbour interaction) models are the most promising candidates in reducing accelerations and decelerations to realistic values. We focus on two such models and, in particular, their linear stability and how these affect the vehicle dynamics and wave solutions. As found earlier [4], multiple look-ahead models reproduce many real flow features, and our results further support the necessity of this ansatz. However, the problem of non-locality arises when they are transformed into the corresponding continuum model. We discuss three methods of how to interpret many-neighbour interaction in macroscopic models.Received: 27 March 2004, Published online: 12 July 2004PACS: 45.70.Vn Granular models of complex systems; traffic flow - 89.90. + n Other topics in areas of applied and interdisciplinary physics - 47.50. + d Non-Newtonian fluid flows  相似文献   
23.
24.
Let G be a compact Hausdorff group and n a positive integer. It is proved that all subnormal subgroups of G of index dividing n are open if and only if there are only finitely many such subgroups, and that all subgroups of finite index in G are open if and only if there are only countably many such subgroups.  相似文献   
25.
This paper presents a set of acoustical and meteorological data from an outdoor sound propagation experiment. This experiment was done in a farm field near Rock Springs, Pennsylvania, on 7 July 1990. Meteorological and acoustical measurements were recorded simultaneously during six different times in the day. The meteorological measurements permitted determination of the sound speed profiles during each of the measurement sessions, using a method based on surface-layer similarity scaling. The acoustical measurements allowed precise determination of the relative sound pressure levels for a frequency range up to 3150 Hz at six different distances (66, 88, 125, 175, 250 and 350 m). The results show atmospheric conditions have an important effect on sound propagation. At medium and high frequencies, variations of the relative SPL have been measured at distances as short as 62 m. These effects increased with the distances so that variations as great as 30 dB have been measured during that day. Comparisons with the fast field program predictions are also presented, and amply demonstrate the accuracies of this model, especially for the downward refraction cases.  相似文献   
26.
27.
28.
In this paper, the multi-item, single-level, capacitated, dynamic lot sizing problem with set-up carry-over and backlogging, abbreviated to CLSP+, is considered. The problem is formulated as a mixed integer programming problem. A heuristic method consisting of four elements: (1) a demand shifting rule, (2) lot size determination rules, (3) checking feasibility conditions and (4) set-up carry-over determination, provides us with an initial feasible solution. The resulting feasible solution is improved by adopting the corresponding set-up and set-up carry-over schedule and re-optimizing it by solving a minimum-cost network flow problem. Then the improved solution is used as a starting solution for a tabu search procedure, with the value of moves assessed using the same minimum-cost network problem. Computational results on randomly generated problems show that the algorithm, which is coded in C++, is able to provide optimal solutions or solutions extremely close to optimal. The computational efficiency makes it possible to solve reasonably large problem instances routinely on a personal computer.  相似文献   
29.
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号